On the Complexity of Global Constraint Satisfaction
نویسندگان
چکیده
We study the computational complexity of decision and optimization problems that may be expressed as boolean contraint satisfaction problem with the global cardinality constraints. In this paper we establish a characterization theorem for the decision problems and derive approximation hardness results for the corresponding global optimization problems.
منابع مشابه
Tractable Combinations of Global Constraints
We study the complexity of constraint satisfaction problems involving global constraints, i.e., special-purpose constraints provided by a solver and represented implicitly by a parametrised algorithm. Such constraints are widely used; indeed, they are one of the key reasons for the success of constraint programming in solving real-world problems. Previous work has focused on the development of ...
متن کاملInformation Hiding and the Complexity of Constraint Satisfaction
This paper discusses the complexity of constraint satisfaction, and the eeect of information hiding. On the one hand, powerful constraint satisfaction is necessarily global, and tends to break information hiding. On the other hand, preserving strict information hiding increases the complexity of constraint satisfaction, or severely limits the power of the constraint solver. Ultimately, under st...
متن کاملOn the Parallel Complexity of Some Constraint Satisfaction Problems
Constraint satisfaction networks have been shown to be a very useful tool for knowledge representation in Artificial Intelligence applications. These networks often utilize local constraint propagation techniques to achieve global consistency (consistent labelling in vision). Such methods have been used extensively in the context of image understanding and interpretation, as well as planning, n...
متن کاملOn the Subexponential Time Complexity of CSP
Not all NP-complete problems share the same practical hardness with respect to exact computation. Whereas some NP-complete problems are amenable to efficient computational methods, others are yet to show any such sign. It becomes a major challenge to develop a theoretical framework that is more fine-grained than the theory of NP-completeness, and that can explain the distinction between the exa...
متن کاملConstraints , Consistency , and
Although the constraint satisfaction problem is NP-complete in general, a number of constraint classes have been identiied for which some xed level of local consistency is suucient to ensure global consistency. In this paper , we describe a simple algebraic property which characterises all possible constraint types for which strong k-consistency is suucient to ensure global consistency, for eac...
متن کامل